Infinite Sparse Threshold Unit Networks
نویسندگان
چکیده
In this paper we define a kernel function which is the primal space equivalent of infinitely large sparse threshold unit networks. We first explain how to couple a kernel function to an infinite recurrent neural network, and next we use this definition to apply the theory to sparse threshold unit networks. We validate this kernel function with a theoretical analysis and an illustrative signal processing task.
منابع مشابه
Robust Fault Detection on Boiler-turbine Unit Actuators Using Dynamic Neural Networks
Due to the important role of the boiler-turbine units in industries and electricity generation, it is important to diagnose different types of faults in different parts of boiler-turbine system. Different parts of a boiler-turbine system like the sensor or actuator or plant can be affected by various types of faults. In this paper, the effects of the occurrence of faults on the actuators are in...
متن کاملIntermediate-node initiated reservation (IIR): a new signaling scheme for wavelength-routed networks with sparse conversion
In this work, we propose a new distributed signaling scheme, within the GMPLS framework, for establishing lightpaths in wavelength-routed networks with sparse wavelength conversion. Analytical models are developed to evaluate the performance of the proposed scheme. Theoretical and simulation results show that compared to the classic scheme designed primarily for networks with no wavelength conv...
متن کاملSolving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks
Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem. Then, we use...
متن کاملA numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملA sparse Laplacian in tensor product wavelet coordinates
We construct a wavelet basis on the unit interval with respect to which both the (infinite) mass and stiffness matrix corresponding to the one-dimensional Laplacian are (truly) sparse and boundedly invertible. As a consequence, the (infinite) stiffness matrix corresponding to the Laplacian on the n-dimensional unit box with respect to the n-fold tensor product wavelet basis is also sparse and b...
متن کامل